On dense strongly Z2s+1-connected graphs
نویسندگان
چکیده
منابع مشابه
On dense strongly Z2s-1-connected graphs
Let G be a graph and s > 0 be an integer. If, for any function b : V (G) → Z2s+1 satisfying v∈V (G) b(v) ≡ 0 (mod 2s+1), G always has an orientation D such that the net outdegree at every vertex v is congruent to b(v)mod 2s+1, then G is strongly Z2s+1-connected. For a graph G, denote by α(G) the cardinality of a maximum independent set of G. In this paper, we prove that for any integers s, t ...
متن کاملOn strongly dense submodules
The submodules with the property of the title ( a submodule $N$ of an $R$-module $M$ is called strongly dense in $M$, denoted by $Nleq_{sd}M$, if for any index set $I$, $prod _{I}Nleq_{d}prod _{I}M$) are introduced and fully investigated. It is shown that for each submodule $N$ of $M$ there exists the smallest subset $D'subseteq M$ such that $N+D'$ is a strongly dense submodule of $M$ and $D'bi...
متن کاملOn strongly connected orientations of graphs
We consider finite, loopless graphs or digraphs, without multiple edges or arcs (with no pairs of opposite arcs). Let G = (V,E) be a graph. A digraph D = (V,A) is an orientation of G if A is created from E by replacing every edge of E by an arc in one direction. Let nd denote the number of vertices with the degree d in G. By the degree pair of a vertex v ∈ V in D the ordered pair [outdegree(v),...
متن کاملMaking Bidirected Graphs Strongly Connected
We consider problems to make a given bidirected graph strongly connected with minimum cardinality of additional signs or additional arcs. For the former problem, we show the minimum number of additional signs and give a linear-time algorithm for finding an optimal solution. For the latter problem, we give a linear-time algorithm for finding a feasible solution whose size is equal to the obvious...
متن کاملon strongly dense submodules
the submodules with the property of the title ( a submodule $n$ of an $r$-module $m$ is called strongly dense in $m$, denoted by $nleq_{sd}m$, if for any index set $i$, $prod _{i}nleq_{d}prod _{i}m$) are introduced and fully investigated. it is shown that for each submodule $n$ of $m$ there exists the smallest subset $d'subseteq m$ such that $n+d'$ is a strongly dense submodule of $m$...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2016
ISSN: 0012-365X
DOI: 10.1016/j.disc.2015.10.033